A 2-approximation algorithm for the minimum weight edge dominating set problem
نویسندگان
چکیده
منابع مشابه
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set
Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone has some fault-tolerance. A k-connected m-fold dominating set ((k,m)-CDS) of a graph G is a node set D such that every node in V \ D has at least m neighbor...
متن کاملA greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem
Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting storms. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. This could be modeled as a k-connected, m-fold dominating set ((k,m)-CDS). Given ...
متن کاملA 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
متن کامل
A (4 + ǫ)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
We present a (4 + ǫ)-approximation algorithm for the problem of computing a minimum-weight dominating set in unit disk graphs, where ǫ is an arbitrarily small constant. The previous best known approximation ratio was 5+ǫ. The main result of this paper is a 4-approximation algorithm for the problem restricted to constant-size areas. To obtain the (4 + ǫ)-approximation algorithm for the unrestric...
متن کاملEdge-Dominating Set Problem
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00383-8